
<html>
<head>
	<meta http-equiv="Content-Type" content="text/html; charset=utf-8">
	<link rel=stylesheet href='include/hoj.css' type='text/css'>
</head>
<body>
<center>
<div style="width:90%; text-align:left">
<img src="image/logo.png"/>
</div>
<table width=96%> 
	<tr align="center" class='hd' valign="top">
				<th><a href="faqs.php">F.A.Qs</a></th>
		<th><a href="./bbs.php">Web Board</a></th>
		<th><a href="./">Home</a></th>
		<th><a href="./problemset.html">ProblemSet</a></th>
		<th><a href="./status.php">Status</a></th>
		<th><a href="./ranklist.php">Ranklist</a></th>
		<th><a href="./contest.php">Contest</a></th>
		<th><a href=loginpage.php>Login</a></th><th><a href=registerpage.php>Register</a></th>	</tr>
</table>
</center>
<center>
<div class="notice">
	<div>
		<B>Notice:</B>鉴于种种原因，本OJ自下周星期一（3月5号）开始不再全面开放，请各位做好善后事宜，谢谢合作。	</div>
</div>
</center>
</div>
<title>Problem 1767. -- [Ceoi2009]harbingers -- 衡阳八中OJ离线版-2012-02-29</title><center><h2>1767: [Ceoi2009]harbingers</h2><span class=green>Time Limit: </span>10 Sec&nbsp;&nbsp;<span class=green>Memory Limit: </span>64 MB<br><span class=green>Submit: </span>220&nbsp;&nbsp;<span class=green>Solved: </span>61<br>[<a href='submitpage.php?id=1767'>Submit</a>][<a href='problemstatus.php?id=1767'>Status</a>][<a href='bbs.php?id=1767'>Discuss</a>]</center><h2>Description</h2><div class=content>给定一颗树，树中每个结点有一个邮递员，每个邮递员要沿着唯一的路径走向capital(1号结点)，每到一个城市他可以有两种选择：
1.继续走到下个城市
2.让这个城市的邮递员替他出发。
每个邮递员出发需要一个准备时间W[I]，他们的速度是V[I]，表示走一公里需要多少分钟。
现在要你求出每个城市的邮递员到capital的最少时间(不一定是他自己到capital，可以是别人帮他）

N<=100000

3 ≤  N ≤  100 000 
0 ≤  Si≤ 10^9
 
1 ≤  Vi≤ 10^9
 
The length of each road will not exceed 10 000 
For 20% of the tests, N ≤  2 500 
For 50% of the tests, each town will have at most 2 adjacent roads (i.e., the graph of 
roads will be a line) </div><h2>Input</h2><div class=content>N
以下N-1行A,B,C三个数表示A,B之间有一条长为C的边。
再N行每行两数Wi,Vi
输出有一行N-1个数表示如题所述。
</div><h2>Output</h2><div class=content></div><h2>Sample Input</h2>
			<div class=content><span class=sampledata>5 <br />
1 2 20 <br />
2 3 12 <br />
2 4 1 <br />
4 5 3 <br />
26 9 <br />
1 10 <br />
500 2 <br />
2 30 </span></div><h2>Sample Output</h2>
			<div class=content><span class=sampledata>206 321 542 328 </span></div><h2>HINT</h2>
			<div class=content><p><img border="0" src="images/1767.jpg"> <br />
</p></div><h2>Source</h2>
			<div class=content><p><a href='problemset.html?search='></a></p></div><center>[<a href='submitpage.php?id=1767'>Submit</a>][<a href='problemstatus.php?id=1767'>Status</a>][<a href='bbs.php?id=1767'>Discuss</a>]</center>﻿<br>

<a href="./"><span class=red>HOME</span></a>
<a href="javascript:history.go(-1)"><span class=red>Back</span></a>

<hr>
<center>
	<div class="footer">
			<a href=setlang.php?lang=ko>한국어</a>&nbsp;
		<a href=setlang.php?lang=cn>中文</a>&nbsp;
		<a href=setlang.php?lang=fa>فارسی</a>&nbsp;
		<a href=setlang.php?lang=en>English</a>&nbsp;
		<a href=setlang.php?lang=th>ไทย</a>
	<br>		<div>版权所有 &copy;2008-2012 WaterPark Organization. | <script src="http://s21.cnzz.com/stat.php?id=2982771&web_id=2982771" language="JavaScript"></script>
</div>
		<div>Based on opensource project <a href="http://hustoj.googlecode.com">hustoj</a>.</div>
	</div>
</center>
</body>
</html>
